| 翻訳と辞書 |
| Nitin Saxena ： ウィキペディア英語版 |
Nitin Saxena
Nitin Saxena ((ヒンディー語:नितिन सक्सेना)) (born 3 May 1981〔(Saxena's CV at University of Bonn )〕) is an Indian scientist, active in the fields of mathematics and theoretical computer science. His research focuses on topics in computational complexity, especially algebraic approaches.
He, along with Manindra Agrawal and Neeraj Kayal proposed the AKS Primality Test in 2002, for which the trio won the 2006 Fulkerson Prize, and the 2006 Gödel Prize. The test is the first unconditional deterministic algorithm to test an ''n''-digit number for primality in a time that has been proven to be polynomial in ''n''. This research work came out as a part of his undergraduate study.
He is an alumnus of Boys' High School And College, Allahabad.He graduated with his B.Tech in Computer Science and Engineering from Indian Institute of Technology Kanpur in 2002. In 2006 he received his PhD from the Department of Computer Science and Engineering of the same institute with the Dissertation titled "Morphisms of Rings and Applications to Complexity".〔(Saxena's PhD thesis )〕
In 2003, he was awarded the Distinguished Alumnus Award of the Indian Institute of Technology Kanpur for his work in computational complexity theory. He was appointed at the Centrum Wiskunde & Informatica (CWI) starting as a postdoc researcher from September 1, 2006.〔()〕 He was a Bonn Junior Fellow at the University of Bonn from Summer 2008 onwards.〔 He joined the Department of Computer Science and Engineering at IIT Kanpur as faculty in April 2013.〔(【引用サイトリンク】url=http://www.cse.iitk.ac.in/ )〕
==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Nitin Saxena」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|